Upper bound on lattice stick number of knots
نویسندگان
چکیده
منابع مشابه
An upper bound for the number of planar lattice triangulations
We prove an exponential upper bound for the number f(m,n) of all maximal triangulations of the m × n grid: f(m,n) < 2. In particular, this improves a result of S. Yu. Orevkov [1]. We consider lattice polygons P (with vertices in Z), for example the convex hull of the grid Pm,n := {0, 1, . . . , m} × {0, 1, . . . , n}. We want to estimate the number of maximal lattice triangulations of P , i.e.,...
متن کاملThe Upper Bound on Knots in Neural Networks
Neural networks with rectified linear unit activations are essentially multivariate linear splines. As such, one of many ways to measure the “complexity” or “expressivity” of a neural network is to count the number of knots in the spline model. We study the number of knots in fully-connected feedforward neural networks with rectified linear unit activation functions. We intentionally keep the n...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملAn Upper Bound Theorem concerning lattice polytopes
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of integrally closed lattice polytopes. Finally we apply our results for reflexive integrally closed and order polytopes.
متن کاملAn upper bound on the number of Steiner triple systems
Richard Wilson conjectured in 1974 the following asymptotic formula for the number of n-vertex Steiner triple systems: STS(n) = ( (1 + o(1)) n e2 )n2 6 . Our main result is that STS(n) ≤ ( (1 + o(1)) n e2 )n2 6 . The proof is based on the entropy method. As a prelude to this proof we consider the number F (n) of 1factorizations of the complete graph on n vertices. Using the KahnLovász theorem i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 2013
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s0305004113000212